Nine Universal Circular Post Machines
نویسندگان
چکیده
We consider a new kind of computational device like Turing machine, so-called circular Post machines with a circular tape and moving in one direction only, introduced recently by the second and the third authors. Using 2-tag systems we construct new nine small universal machines of this kind.
منابع مشابه
Small Universal Circular Post Machines
We consider a new kind of machines with a circular tape and moving in one direction only, so-called Circular Post machines. Using 2-tag systems we construct some small universal machines of this kind.
متن کاملA Simplified Van Erth Single Nucleotide Polymorphism (SNP) Typing Method of Bacillus Anthracis Applicable by Traditional Thermocycler Machines
Abstract SNP typing is now a well-established genotyping system in Bacillus anthracis studies. In the original standard method of Van Erth, SNPs at 13 loci of the B. anthracis genome were analyzed. In order to simplify and make appropriate this expensive method to low-budget laboratory settings, 13 primer pairs targeting the 13 corresponding SNPs were designed. Besides, a universal PCR proto...
متن کاملOn the Universality of Post and Splicing Systems
In search for a universal splicing system, in this paper we present a Post system universal for the class of Post systems, and we discuss its translation into an extended splicing system with multiplicity. We also discuss the complexity of the resulting universal splicing system, comparing our result with recent known results about the translation of universal Turing machines into splicing syst...
متن کاملOn the Power of Circular Splicing Systems and DNA Computability
From a biological motivation of interactions between linear and circular DNA sequences, we propose a new type of splicing models called circular H systems and show that they have the same computational power as Turing machines. It is also shown that there e ectively exists a universal circular H system which can simulate any circular H system with the same terminal alphabet, which strongly sugg...
متن کاملSome improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The Computer Science Journal of Moldova
دوره 10 شماره
صفحات -
تاریخ انتشار 2002